Nonsmooth convex caustics for Birkhoff billiards
نویسندگان
چکیده
منابع مشابه
On nonconvex caustics of convex billiards
Oliver Knill July 29, 1996 Abstract There are billiard tables of constant width, for which the billiard map has invariant curves in the phase space which belong to continuous but nowhere di erentiable caustics. We apply this to construct ruled surfaces which have a nowhere di erentiable lines of striction. We use it also to get Riemannian metrics on the sphere such that the caustic belonging at...
متن کاملNonpersistence of Resonant Caustics in Perturbed Elliptic Billiards
Caustics are curves with the property that a billiard trajectory, once tangent to it, stays tangent after every reflection at the boundary of the billiard table. When the billiard table is an ellipse, any nonsingular billiard trajectory has a caustic, which can be either a confocal ellipse or a confocal hyperbola. Resonant caustics —the ones whose tangent trajectories are closed polygons— are d...
متن کاملMaximizing Orbits for Higher Dimensional Convex Billiards
The main result of this paper is, that for convex billiards in higher dimensions, in contrast with 2D case, for every point on the boundary and for every n there always exist billiard trajectories developing conjugate points at the n-th collision with the boundary. We shall explain that this is a consequence of the following variational property of the billiard orbits in higher dimension. If a ...
متن کاملOn Conjugacy of Convex Billiards
Given a strictly convex domain Ω ⊂ R2, there is a natural way to define a billiard map in it: a rectilinear path hitting the boundary reflects so that the angle of reflection is equal to the angle of incidence. In this paper we answer a relatively old question of Guillemin. We show that if two billiard maps are C2-conjugate near the boundary, then the corresponding domains are similar, i.e. the...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2018
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.2018.295.257